Method and system for reducing overflows in a computer graphics system

ABSTRACT

A method and system for providing a graphical image on a display of a system is disclosed. The graphical image is provided from data describing a plurality of primitives. The display includes a plurality of pixels. The method and system include providing a plurality of variable-sized bins containing the plurality of primitives and rendering the plurality of primitives by rendering each of the plurality of variable-sized bins variable-sized bin by variable-sized bin.

This application claims the benefit of Provisional Application Ser. No.60/201,034, filed May 1, 2001.

FIELD OF THE INVENTION

The present invention relates to graphics processing in a computersystem, and more particularly to a method and system for moreefficiently rendering a graphical image.

BACKGROUND OF THE INVENTION

A conventional computer graphics system can display a graphical image ona display. The display includes a plurality of display elements, knownas pixels, typically arranged in a grid. In order to display objects,the conventional computer graphics system typically breaks the objectsinto a plurality of polygons. The conventional system then typicallyrenders the polygons in a particular order. For a three-dimensionalscene, the polygons are generally rendered from back to front asmeasured from the viewing plane of the display. Similarly, atwo-dimensional scene can be displayed where polygons are rendered basedon their layer. Shallower layers occlude deeper layers.

For example, FIG. 1 is a block diagram of a display 1 depicting agraphical image. The display includes a plurality of pixels 8, only oneof which is labeled. The graphical image includes primitives 2, 3, 4, 5,and 6 which may be part of one or more objects. Each of the primitives2, 3, 4, 5, and 6 may cover several pixels and includes a plurality offragments. Each fragment includes data for a pixel intersected by thecorresponding primitive. Thus, a fragment may include data relating tothe color, texture, α values, and depth values for a particularprimitive and a particular pixel.

One conventional method used in rendering the graphical image rendersthe image primitive by primitive in a particular order. For athree-dimensional scene, the primitives are generally rendered from backto front as measured from the viewing plane of the display. Similarly, atwo-dimensional scene can be displayed where primitives are renderedbased on their layer. Shallower layers occlude deeper layers. Forexample, the primitive 2 might be rendered first, followed in order byprimitives 3, 4, 5, and 6.

FIG. 2A depicts another conventional method 10 for rendering a graphicalimage. FIG. 2B depicts a display 20 including the primitives 2, 3, 4, 5,and 6 which are rendered using the conventional method 10. Referring toFIGS. 2A and 2B, in order to render the graphic image, portions of thedisplay 1 are rendered one at a time. Thus, a plurality of tiles, eachtile having a fixed size, is defined, via step 12. A tile is typically atwo-dimensional rectangle containing n ×m pixels. The tiles 21, 22, 23,24, 25, 26, 27, 28, and 29 are depicted in the display 20. Theprimitives 2, 3, 4, 5, and 6, or portions thereof, are then renderedtile by tile and primitive by primitive. For example, the portion of theprimitive 2 in tile 21 is rendered first. When tile 21 has completedrendering, the portion of the primitive 4 in tile 22 is rendered. Whentile 22 is completed, the portions of the primitives 4 and 6 in tile 23are rendered. This process continues, rendering the graphical imageprimitive by primitive and tile by tile, until all primitives in alltiles have been rendered.

Although these conventional methods function, one of ordinary skill inthe art will readily realize that it is desirable to provide data for animage in raster order. Furthermore, it would desirable if the image isefficiently rendered. Consequently, STELLAR SEMICONDUCTOR of San Jose,Calif. developed a system for rendering a graphical image pixel bypixel, in raster order. Raster order is from left to right and top tobottom across the display 1. This system is described in U.S. patentapplication Ser. No. 08/624,261, entitled “METHOD AND APPARATUS FORIDENTIFYING AN ELIMINATING THREE-DIMENSIONAL OBJECTS VISUALLY OBSTRUCTEDFORM A PLANAR SURFACE” filed on Mar. 29, 1996 now Pat. No. 5,926,181,and assigned to the assignee of the present application and inco-pending U.S. patent application Ser. No. 08/624,260, entitled“GRAPHICS PROCESSORS, SYSTEM AND METHOD FOR GENERATING SCREEN PIXELS INRASTER ORDER UTILIZING A SINGLE INTERPOLATOR” filed on Mar. 29, 1996 nowPat. No. 5,933,210, and assigned to the assignee of the presentapplication.

FIG. 3 depicts a high-level block diagram of one embodiment of such acomputer graphics system 50. The system 50 includes a central processingunit (CPU) 52, a display 54, a user interface 56 such as a keyboard ormouse or other communicating device, a memory 58, and an imagegenerating unit 60 coupled with one or more buses 58. The display 54includes a display, such as the display 1. The display 14 also includesa display memory 55 to which data for pixels are written prior to beingshown on the display 1. In order to display graphical images, theobjects are broken into polygons to be used in rendering the objects. Ina preferred embodiment, the polygons are rendered in raster order. Thatis, portions of the polygons are rendered pixel by pixel in the order ofthe pixels in the display 54.

The image generating unit 60 is used in rendering the graphical image.The image generating unit includes an interface 61 connected to the bus58. The interface 61 transmits data to a data processing unit 62. Theblock of processors 64 identifies data describing portions of primitives(“intersecting primitives”) which intersect the area extending along az-axis from a selected pixel in an x-y plane corresponding to a screenof the display 14. The block of processors 64 may include a number ofprocessors, allowing intersecting primitives to be processed inparallel. By processing the primitives in parallel, the block ofprocessors 64 can provide an indication of the fragments that intersectpixels currently being processed in a particular scan line. Anobstructed object identifier/removal unit (Quick Z) 66 receives at leasta portion of the fragment from each intersecting polygon associated withthe selected pixel and removes portions of the fragments forintersecting polygons that are obstructed.

The interpolator 68 receives the remaining fragments for theintersecting polygons for the selected pixel and interpolates the data,including interpolating texture, color, and alpha values for thefragment. The interpolator 68 also provides a coverage mask for eachfragment. The coverage mask indicates the portion of the pixel that thefragment covers. The fragments for remaining intersecting polygons areprovided by the interpolator 68 to a hardware sorter 70. The hardwaresorter 70 sorts the fragments for the intersecting polygons based on thevalue of a key such as the z value, or depth value, for the fragment.

An antialiasing/blending/accumulating unit 72 performs antialiasingusing the mask provided by the interpolator 68. The antialiasing unit 72may multiple units used in antialiasing, accumulating data, and blendingdata. The antialiased data is provided to the display 14 pixel by pixelin raster order.

Although the above-mentioned co-pending applications function well fortheir intended purpose, the processors in the block of processors 64 mayoverflow. In order to render the images in raster order, a number of theprimitives intersecting pixels in a particular scan line (a row ofpixels on the display 1) are processed in parallel. There are also afinite number of processors in the block of processors 64. For example,in one embodiment, sixty-four processors are provided in the block ofprocessor block 64. When a particular scan line contains a large numberof primitives, more primitives than processors in the block ofprocessors 64 may be attempted to be processed in parallel. The block ofprocessors 64 may then overflow. Such an overflow is undesirable.Furthermore, efficient rendering of the graphical image is desired.

Accordingly, what is needed is a system and method for efficientlyrendering a graphical image. It would be desirable if an overflow ofprocessors can be avoided. The present invention addresses such a need.

SUMMARY OF THE INVENTION

The present invention provides a method and system for providing agraphical image on a display of a system. The graphical image isprovided from data describing a plurality of primitives. The displayincludes a plurality of pixels. The method and system comprise providinga plurality variable-sized bins containing the plurality of primitivesand rendering the plurality of primitives by rendering each of theplurality of variable-sized bins variable-sized bin by variable-sizedbin. In a first aspect, the system also includes a plurality ofprocessors for processing a portion of the plurality of primitives inparallel. In this aspect, the variable-sized bin providing step furtherincludes the steps of storing the plurality of primitives in a pluralityof bins and determining if a part of a portion of the plurality of binscan be combined without causing the plurality of processors to overflow.In this aspect, the method and system also comprise combining the partof the portion of the plurality of bins to provide the plurality ofvariable-sized bins if the part of the portion of the plurality of binscan be combined without causing the plurality of processors to overflow.The plurality of variable-sized bins can include fewer bins than theplurality of bins. In another aspect, the method and system furtherinclude determining a plurality of bins for a previous frame andproviding the plurality of bins containing the plurality of primitives.

According to the system and method disclosed herein, the presentinvention efficiently separates the graphical image into variable-sizedbins that can be separately rendered without overflowing the system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of a display including a graphical image.

FIG. 2A is a high-level flow chart of a conventional method forrendering a graphical image.

FIG. 2B is a diagram of the display when the conventional method is usedto render the graphical image.

FIG. 3 is a high-level block diagram of a computer graphics system inwhich the present invention can be used.

FIG. 4A is a high-level flow chart of one embodiment method forrendering a graphical image in accordance with the present invention.

FIG. 4B is a diagram of one way in which a display could be divided inaccordance with the present invention.

FIG. 5A is a flow chart of a first embodiment of a method for providingvariable-sized bins in accordance with the present invention.

FIG. 5B is a diagram of one way in which a display could be divided inaccordance when the first embodiment of a method in accordance with thepresent invention for providing variable-sized bins.

FIG. 5C is a diagram of how the bins are provided and combined inaccordance when the first embodiment of a method in accordance with thepresent invention for providing variable-sized bins.

FIG. 6A is a more detailed flow chart of a preferred version of thefirst embodiment of a method for providing variable-sized bins inaccordance with the present invention.

FIG. 6B is a diagram of how the bins are provided and combined inaccordance when the preferred version of the first embodiment of amethod in accordance with the present invention for providingvariable-sized bins.

FIG. 7A is a flow chart of a second embodiment of a method for providingvariable-sized bins in accordance with the present invention.

FIG. 7B is a diagram of one way in which a display could be divided inaccordance when the second embodiment of a method in accordance with thepresent invention for providing variable-sized bins.

FIG. 7C is a diagram of how the bins are provided and combined inaccordance when the second embodiment of a method in accordance with thepresent invention for providing variable-sized bins.

FIG. 8A is a more detailed flow chart of the second embodiment of amethod for providing variable-sized bins in accordance with the presentinvention.

FIG. 8B is a diagram of how the bins are provided and combined inaccordance when the preferred version of the second embodiment of amethod in accordance with the present invention for providingvariable-sized bins.

DETAILED DESCRIPTION OF THE INVENTION

The present invention relates to an improvement in processing ofgraphical images. The following description is presented to enable oneof ordinary skill in the art to make and use the invention and isprovided in the context of a patent application and its requirements.Various modifications to the preferred embodiment will be readilyapparent to those skilled in the art and the generic principles hereinmay be applied to other embodiments. Thus, the present invention is notintended to be limited to the embodiment shown, but is to be accordedthe widest scope consistent with the principles and features describedherein.

As discussed above, FIG. 1 depicts a display 1 including a graphicalimage. The graphical image includes primitives 2, 3, 4, 5, and 6 whichmay be part of one or more objects. Each of the primitives 2, 3, 4, 5,and 6 may intersect several pixels and includes a plurality offragments. Each fragment includes data for a pixel intersected by thecorresponding primitive. Thus, a fragment may include data relating tothe color, texture, α values, and depth values for a particularprimitive and a particular pixel.

In order to render the graphical image, conventional computer graphicssystems may employ a variety of methods. In one conventional system, thegraphical image is rendered primitive by primitive. For example, theentire primitive 2 may be rendered first. The remaining primitives wouldthen be rendered primitive by primitive. Alternatively, a conventionalcomputer graphics system could break the display 1 into several tile offixed, typically equal, size. The conventional system then renders thegraphical image tile by tile. Thus, the portions of each primitive in aparticular tile are rendered before a portion of the primitives inanother tile.

In order to improve the efficiency of memory use, a recently developedcomputer graphics system renders a graphical image pixel by pixel, inraster order. Thus, fragments for all of the primitives intersecting aparticular pixel are rendered, then the fragments for primitivesintersecting another pixel are rendered. Such a system 50 is depicted inFIG. 2.

Although this method and system 50 depicted in and discussed inconjunction with FIG. 2 function effectively, the system 50 utilizes aplurality of processors in the block of processors 64. The processorsprocesses primitives intersecting a particular scan line in parallel.Preferably all of the primitives intersecting a scan line are processedin parallel. Because there are a finite number of processors, the numberof primitives intersecting a scan line can exceed the number ofprocessors. Consequently, the processors in the block of processors 64may overflow, which adversely affects system performance.

The present invention provides a method and system for providing agraphical image on a display of a system. The graphical image isprovided from data describing a plurality of primitives. The displayincludes a plurality of pixels. The method and system comprise providinga plurality variable-sized bins containing the plurality of primitivesand rendering the plurality of primitives by rendering each of theplurality of variable-sized bins variable-sized bin by variable-sizedbin. In a first aspect, the system also includes a plurality ofprocessors for processing a portion of the plurality of primitives inparallel. In this aspect, the variable-sized bin providing step furtherincludes the steps of storing the plurality of primitives in a pluralityof bins and determining if a part of a portion of the plurality of binscan be combined without causing the plurality of processors to overflow.In this aspect, the method and system also comprise combining the partof the portion of the plurality of bins to provide the plurality ofvariable-sized bins if the part of the portion of the plurality of binscan be combined without causing the plurality of processors to overflow.The plurality of variable-sized bins can include fewer bins than theplurality of bins. In another aspect, the method and system furtherinclude determining a plurality of bins for a previous frame andproviding the plurality of bins containing the plurality of primitives.

The present invention will be described in terms of being implemented ina particular system for a particular reason. However, one of ordinaryskill in the art will readily recognize that this method and system willoperate effectively for other systems. Furthermore, the presentinventions will be described in terms of specific algorithms. However,one of ordinary skill in the art will readily realize that the presentinvention is consistent with the use of other algorithms. For example,certain steps of the flow charts described herein could be performed inanother order, including in parallel. In addition, the present inventioncan be implemented in hardware, rather than in software. The presentinvention will also be described in the context of a particular numberand type of processors, sections, bins, and primitives. The presentinvention will also be described in terms of a particular overflowcondition based on the number or processors. However, one of ordinaryskill in the art will readily recognize that the present invention isconsistent with another number and type of processors, sections, bins,and primitives as well as a different overflow parameter.

To more particularly illustrate the method and system in accordance withthe present invention, refer now to FIG. 4A, depicting a high-level flowchart of one embodiment of method for rendering a graphical image inaccordance with the present invention. The method is preferablyimplemented on the system 50 depicted in FIG. 2. In a preferredembodiment, the method and system in accordance with the presentinvention is implemented by or include software that may be stored inthe memory 59 and executed by the CPU 52. However, in anotherembodiment, the software could be stored elsewhere or executed byanother processor (not shown), such as one residing with the imagegeneration unit 60.

Referring now to FIG. 4A, a plurality of variable-sized bins containingthe primitives are provided, via step 102. A bin is variable sized whenthe section of the display (described below) to which the bincorresponds can vary in size. Preferably, the primitives intersecting aparticular variable-sized bin are stored in the variable-sized bin basedon the primitives' minimum y-value and whether or not the primitivescross the right boundary of the particular variable-sized bin. In apreferred embodiment, each of at least a portion of the variable-sizedbins includes few enough primitives so that the processors in the blockof processors 64 do not overflow. For example, if there are sixty-fourprimitives, then when possible, each variable-sized bin includes no morethan 64 primitives per scan line. However, the primitives allowed in aparticular variable-sized bin may depend on other criteria. Theprimitives are then rendered by rendering the variable-sized binsvariable-sized bin by variable-sized bin, via step 104. Also in apreferred embodiment, step 104 includes rendering each of thevariable-sized bins pixel by pixel in raster order. Thus, if only aportion of a primitive intersects a particular variable-sized bin, onlythat portion of the primitive is rendered when the particularvariable-sized bin is rendered. Thus, step 104 preferably includesproviding the primitives for a scan line in a variable-sized bin to theprocessors in the block of processors 64 of FIG. 3. The portions of theprimitives intersecting pixels within the scan line are then processedby the system 50.

FIG. 4B depicts a generalized view of a display 110 including agraphical image. The display 110 is analogous to the display 1 depictedin FIG. 1. Thus, the graphical image includes primitives 2, 3, 4, 5, and6. The graphical image has been broken into a plurality ofvariable-sized sections 112, 114, 116, 118 and 120. Each of thevariable-sized sections 112, 114, 116, 118, and 120 corresponds to oneof the variable-sized bins. One variable-sized bin stores data for theprimitive 2 and the primitive 3 for the section 112. Similarly a secondvariable-sized bin stores data for the primitive 2 and the primitive 3in the section 114. A third variable-sized bin stores data for theprimitive 4 and the primitive 6 intersecting the section 116. A fourthvariable-sized bin stores a data for the primitives 4, 5, and 6 in thesection 118. A fifth variable-sized bin corresponds to the last section120.

FIG. 5A depicts a more detailed flow chart of a first embodiment of amethod 140 in accordance with the present invention for providingvariable-sized bins. The primitives are stored in a plurality of bins,via step 142, preferably in order based on the minimum y-value of theprimitives. Storing a primitive may include storing the desiredinformation for the primitive. Thus, the primitives are preferablystored from top to bottom along the display 1. Preferably, the bins areof the same size. The size of a bin is determined by the size of asection, discussed below, to which the bin corresponds. It is determinedwhether any portions of the bins, preferably adjacent bins, can becombined without violating an overflow parameter, via step 144. In apreferred embodiment, step 144 determines whether any of the bins, inits entirety, can be combined with another bin, in its entirety. Also ina preferred embodiment, the overflow parameter corresponds to anoverflow of the system. An overflow of the system occurs when there aremore primitives in a bin than there are processors in the block ofprocessors 64, depicted in FIG. 3. Referring back to FIG. 5A, theportions of bins that can be combined are then combined to provide thevariable sized bins, via step 146. In a preferred embodiment, step 146includes combining those bins, in there entirety, which step 144determined could be combined without overflowing the processors toprovide the variable-sized bins. Also in a preferred embodiment,portions of bins can be combined horizontally if the resulting bincrosses the entire display. The variable-sized bins are the provided forrendering, via step 148. Preferably, step 148 includes providing adisplay list including the primitives in each of the variable-sized bin,variable-sized bin by variable-sized bin. In one embodiment, steps 146and 148 can be provided in a single step. Thus, the combining of binscould take place by ordering the primitives appropriately in the displaylist. The variable-sized bins may then be rendered pixel by pixel inraster order.

For an example of how the method 140 functions, refer to FIGS. 5A-5C.For clarity, it is presumed that there are only three processors in theblock of processors 64, depicted in FIG. 2. Thus, the overflow parameteris three. FIG. 5B depicts one way in which the display 150 can bedivided into sections when the method 140 is used. The display 150corresponds to the display 1 and, therefore, includes primitives 2, 3,4, 5, and 6. FIG. 5C depicts the bins 161-166 provided and combined byone preferred embodiment of the method 140. Preferably, the bins 161-166are preferably of the same size. Thus, the sections 151-156 to which thebins 161-166 correspond are preferably of the same size. The display 150is thus broken into sections 151, 152, 153, 154, 155, and 156 of equalsize. Each section 151, 152, 153, 154, 155, and 156 corresponds to aparticular bin 161, 162, 163, 164, 165, and 166, respectively. Theprimitives 2, 3, 4, 5, and 6 are stored in the bins 161-166 whichcorrespond to the sections 161-166 that the primitives 2, 3, 4, 5, and 6intersect. Furthermore, the primitives are stored in minimum y-valueorder. For example, the bin 163 includes primitive 4, 6, 2, 5, and 3, inthat order. It is determined whether any of the bins 161-166 can becombined without causing an overflow. Suppose three processors areavailable. Thus, a bin 161-166 can be combined with another bin 161-166if the combination has three or fewer primitives 2, 3, 4, 5, and 6. Ifsection 151 and 152 are combined, there are only two primitives 2 and 3present in the combined section. Similarly, if sections 154, 155, and156 are combined, there will be three primitives 4, 5, and 6 present inthe combined section. As a result, bins 161 and 162 and bins 164, 165,and 166 can be combined without violating the overflow parameter. Itwill thus be determined in step 144 that bins 161 and 162 and bins 164,165, and 166 can be combined. Consequently, the bins 161 and 162 arecombined to form bin the 167 and the bins 164-166 are combined toprovide the bin 168, using step 146. Note that the bin 163 includes fourprimitives, 2, 3, 4, and 5. Consequently, bin 163 will cause the systemto overflow even if it is not combined. In a preferred embodiment, bins163 will be treated separately, for example by splitting or overlayingportions of the bin 163 to be rendered separately. At least the bins167, 163, and 168 are thus the variable-sized bins provided forrendering.

FIG. 6A depicts a more detailed flow chart of a preferred version of thefirst embodiment of a method 170 for providing the variable sized bins.The primitives 2, 3, 4, 5, and 6 are stored in the appropriate bucketsof equal sized bins, via step 172. Each bin includes a left bucket and aright bucket. A primitive 2, 3, 4, 5, or 6 is stored in a right bucketif the primitive 2, 3, 4, 5, or 6 crosses a right boundary of a sectioncorresponding to a particular bin. A primitive 2, 3, 4, 5, or 6 isstored in the left bucket if the primitive 2, 3, 4, 5, or 6 does notcross the right boundary of the section corresponding to the particularbin. Thus, storing the primitives 2, 3, 4, 5, and 6 may include storingthe data for the primitives in the appropriate buckets. Step 172 alsoincludes ordering the primitives 2, 3, 4, 5, and 6 in the buckets basedon the primitives' minimum y values. Thus, the primitives 2, 3, 4, 5,and 6 are arranged from first to last in the appropriate buckets, basedupon the highest point in the display 150 for the primitive. Inaddition, step 172 includes storing the top and bottom scans for eachprimitive. The top and bottom scans correspond to the minimum andmaximum y-values for the primitive.

It is then determined if any of the bins overflow, via step 174. Thus,step 174 includes determining if any of the bins contain a sufficientnumber of primitives to violate the overflow parameter. Preferably thisis accomplished in one step after the primitives 2, 3, 4, 5, and 6 havebeen stored in the appropriate bins. Step 174 is also preferablyaccomplished by using the top scan line and bottom scan line for eachprimitive store in a bin to determined the whether the number ofprimitives 2, 3, 4, 5, or 6 on a particular scan line of a bin isgreater than the overflow parameter. If the certain bins overflow, thenthese bins are treated separately, via step 176. In a preferredembodiment, step 176 includes overlaying the bins which overflow. Inanother embodiment, step 176 could include splitting the bins thatoverflow is splitting the bin will prevent the overflow. In any event,step 176 includes a mechanism which will allow those bins that overflow,such as the binl63 depicted in FIG. 5C, to be processed preferablywithout causing an overflow of the system 50.

Referring back to FIG. 6A, a bin is selected as a current bin, via step178. In a preferred embodiment, step 178 includes selecting a bin as thecurrent bin only if the bin has been determined not to overflow in step174. It is determined if the current bin can be combined with one ormore other bins without the combination overflowing, via step 180.Preferably, at least one of the other bins is adjacent to the currentbin and the other bins are mutually adjacent. If the current bin cannotbe combined without an overflow, the current bin is considered to be oneof the variable-sized bins. If the current bin cannot be combinedwithout an overflow, then it is determined if all of the desired binshave been attempted to be combined, via step 182.

If it is determined that the current bin can be combined, then thecurrent bin is combined with one or more other bins to provide one ofthe variable-sized bins, via step 184. The bin(s) with which the currentbin are combined with are those which were determined in step 182.Preferably, the current bin is combined with other bin(s) such that aprimitive in more than one bin only appears once in the variable-sizedbin that results from the combination. Step 182 is then returned to.Step 182 determines whether all of the desired bins have been attemptedto be combined. If not, then step 178 is returned to. If so, then adisplay list which orders the primitives variable-sized bin byvariable-sized bin is provided, via step 186. In one embodiment, step184 of combining the bins, is carried out by providing the display listin step 186. In such an embodiment, the primitives in the bins to becombined would be provided together in the display list withoutotherwise combining the bins.

To further explicate the method 170, refer to FIGS. 6B and 5C. FIG. 6Bis a diagram depicting how bins are combined. FIG. 5C depicts thesections 151, 152, 153, 154, 155, and 156 corresponding to the bins. Theprimitives 2, 3, 4, and 5 are stored in the bins 161′, 162′, 163′, 164′,165′, and 166′. The bins 161′, 162′, 163′, 164′, 165′, and 166′correspond to the sections 151, 152, 153, 154, 155, and 156,respectively. Because the primitives 2 and 3 cross the right boundary ofthe bin 161′ (the section 151), the primitives 2 and 3 are stored in theright bucket 182 of the bin 161′. Because there are no primitives in thedisplay 150 that intersect bin 161′ (the section 1521) but do not crossthe right boundary of the bin 161′ (the section 151), the left bucket181 of the bin 161′ is empty. Because the primitives 2 and 3 cross theright boundary of the bin 162′ (the section 152), the primitives 2 and 3are stored in the right bucket 184 of the bin 162′. Because there are noprimitives that intersect bin 162′ (the section 152) but do not crossthe right boundary of the bin 162′ (the section 152), the left bucket183 of the bin 162′ is empty. Because the primitives 4 and 5 cross theright boundary of the bin 163′ (the section 153), the primitives 4 and 5are stored in the right bucket 186 of the bin 163′. Because theprimitives 2 and 3 intersect bin 163′ (the section 153) but do not crossthe right boundary of the bin 163′ (the section 153), primitives 2 and 3are stored in the left bucket 185 of the bin 163′. Because theprimitives 4 and 5 cross the right boundary of the bin 164′ (the section154), the primitives 4 and 5 are stored in the right bucket 188 of thebin 164′. Because there are no primitives that intersect bin 164′ (thesection 154) but do not cross the right boundary of the bin 164′ (thesection 154), the left bucket 187 of the bin 164′ is empty. Because theprimitive 6 crosses the right boundary of the bin 165′ (the section155), the primitive 6 is stored in the right bucket 190 of the bin 165′.Because the primitives 4 and 5 intersect bin 165′ (the section 155) butdo not cross the right boundary of the bin 165′ (the section 155),primitives 4 and 5 are stored in the left bucket 189 of the bin 165′.Because no primitives cross the right boundary of the bin 166′ (thesection 156), the right bucket 192 of the bin 166′ is empty. Because theprimitive 6 intersects bin 166′ (the section 156) but does not cross theright boundary of the bin 166′ (the section 156), the primitive 6 isstored in the left bucket 181 of the bin 162′.

It is presumed that there are four processors in the processor block 64of FIG. 2. Thus, the overflow parameter may be four. Referring back toFIGS. 5A and 6B, none of the bins 161′-166′, or the correspondingsections 151-156, include more than four primitives 2, 3, 4, 5, and 6.Consequently, none of the bins overflow. Thus, all of the bins 161′-166′are candidates to be combined. Because the overflow parameter is four,the bins 161′, 162′, 163′, and 164′ can be combined into bin 167′without overflowing. Thus, primitives 2, 3, 4, and 5 can be stored in asingle bin 167′ that corresponds to the bins 161′-164′ and, therefore,to sections 151-154. For the same reasons, bins 165′ and 166′ can becombined into a single bin 168′ without overflowing.

The bins 161′-166′ are also preferably combined such that the primitives2, 3, 4, and are stored only once in each variable sized bins 167′ and168′. Preferably, this is accomplished by storing only those primitiveswhich are in the left bucket for a bin, except for the last bin that isbeing combined. For the last bin, those primitives in the right bucketand the left bucket are combined. For example, there are no primitivesin the left bucket 181 or 183 for the bins 161′ and 162′. Thus, noprimitives are added. However, primitives 2 and 3 are in the left bucket185 for the bin 163′. Consequently, primitives 2 and 3 are stored in thevariable-sized bin 167′. However, the primitives 4 and 5 are in theright bucket 186 and thus are not stored when the bin 163′ is combined.However, the primitives 4 and 5 are in the right bucket 188 for the lastbin 164′ being combined. Thus, the primitive 4 and 5 are stored in thevariable-sized bin 167′. Consequently, the variable-sized bin 167′includes primitives 4 and 5 in the right bucket 194 and primitive 2 and3 in the right bucket 193. Furthermore, the primitives 2, 3, 4, and 5are stored in order in the variable-sized bin 167′ based on theirminimum y-values. Note, however, that in an alternate embodiment, thevariable-sized bin 167′ could include primitives 2 and 3 in both theright bucket 194 and the left bucket 193 and primitives 4 and 5 in theright bucket 194. In such a case, the right bucket 194 would store theprimitive 2 ahead of the primitive 3 in the left bucket 193. Similarly,the right bucket 194 would store primitives 4, 2, 5, and 3 in orderbecause this arranges the primitives 2, 3, 4, and 5 in minimum y-valueorder.

Similarly, the variable-sized bin 168′ includes primitives 4, 5, and 6.When bin 165′ is combined, primitives 4 and 5 in the left bucket 189 arestored in the left bucket 195 of the variable-sized bin 168′. Theprimitive 6 is not stored because it is in the right bucket 190 of thebin 165′. However, when the bin 165′ is combined, the primitive 6 isstored because it is in the left bucket 191 of the bin 166′. If therewere primitives in the right bucket 192, those primitives would havebeen stored in the variable-sized bin 168′ because the bin 166′ is thelast bin being combined.

A display list is then provided from the variable-sized bins 167′ and168′. The display list preferably provides the primitives variable-sizedbin by variable-sized bin and preferably orders the primitives inminimum y-value order. Consequently, the display list would includeprimitives 4, 2, 5, and 3 then primitives 4, 6, and 5. The portions ofprimitives 4, 2, 5, and 3 intersecting the variable-sized bin 167′(intersecting sections 151, 152, 153, and 154) are rendered first,followed by the portions of primitives 4, 6, and 5 intersecting thevariable sized bin 168′ (intersecting sections 155 and 156). The displaylist allows the primitives in a scan line to be provided in parallel tothe processors of the block of processors in FIG. 3 and the pixels ineach of the variable-sized bins 167′ and 168′ pixel by pixel in rasterorder.

Because the methods 100, 140, and 170 render the graphical imagevariable-sized bin by variable-sized bin, the efficiency of rendering isimproved. Each variable-sized bin either does not overflow or is treatedseparately. In either case, each variable-sized bin can be renderedwithout causing an overflow in the computer graphics system, such as thesystem 50. Therefore, the primitives in a scan line for eachvariable-sized bin can be provided in parallel to processors in theblock of processors 64. Each variable-sized bin can, therefore, berendered pixel-by pixel in raster order without overflowing or slowingthe system 50. Consequently, efficiency of providing graphical images isimproved.

FIG. 7A depicts a more detailed flow chart of a second embodiment of amethod 200 in accordance with the present invention for providingvariable-sized bins. The method 200 is used to render a graphical imagethat is part of a series of graphical images. Each graphical image inthe series in known as a frame. A plurality of bins is determined basedon a previous frame, via step 202. Preferably, the plurality of bins wasconsidered to be optimal under some set of criteria for rendering theprevious frame. In a preferred embodiment, a set of bins is optimal ifthe previous frame can be rendered using the smallest total number ofbins and having the smallest number of bins which violate the overflowparameter. Thus, each of the plurality of bins provided in step 202 canpreferably vary in size. Also in a preferred embodiment, the previousframe is the frame immediately previous to the frame currently beingrendered. In one embodiment, the plurality of variable-sized bins wasactually used to render the previous frame. Thus, the variable sizedbins are determined when the previous frame was rendered. In anotherembodiment, the plurality of variable-sized bins was not used to renderthe previous frame, but are determined between frames.

The plurality of variable-sized bins that store the primitives are thenprovided, via step 204, based on the plurality of bins determined instep 202. In one embodiment, the plurality of variable-sized bins is thesame as the bins determined in step 202. In another embodiment, theplurality of variable-sized bins is provided based on the binsdetermined in step 202. For example, portions of or all of some numberof the bins determined in step 202 may be combined or split to providethe variable-sized bins, as discussed below. Step 202 preferablyincludes storing the primitives in the variable-sized bins in orderbased on the minimum y-value of the primitives. Step 202 also preferablyincludes storing the top and bottom scan values.

FIG. 7B depicts the display 210 having a plurality of sections 211, 212,213, 214, 215, 216, and 217 corresponding to a plurality of bins whichwere determined based on a previous frame. FIG. 7C depicts the bins 221,222, 223, 224, 225, 226, and 227 corresponding to the sections 211, 212,213, 214, 215, 216, and 217, respectively. The bins 221-227 store theprimitives 2, 3, 4, 5, and 6. In one embodiment of the method 200, thebins 221-227 are used as the variable-sized bins in the step 204. Inanother embodiment of the method 200, the variable-sized bins areprovided based on the bins 221-227, for example by combining portions ofone or more bins 221-227 or by splitting one or more of the bins221-227. Such an embodiment might be considered to be a combination ofthe method 200 and the method 140 or 170.

FIG. 8A depicts one version of the second embodiment of a method 230 inaccordance with the present invention. The method 230 can be consideredto be a combination of the method 200 and the method 170. The pluralityof bins is determined based on a previous frame, via step 232. Via step234, the primitives 2, 3, 4, 5, and 6 are stored in the appropriatebuckets of the bins which were determined in step 232. Each bin includesa left bucket and a right bucket. A primitive 2, 3, 4, 5, or 6 is storedin a right bucket if the primitive 2, 3, 4, 5, or 6 crosses a rightboundary of a section corresponding to a particular bin. A primitive 2,3, 4, 5, or 6 is stored in the left bucket if the primitive 2, 3, 4, 5,or 6 does not cross the right boundary of the section corresponding tothe particular bin. Thus, storing the primitives 2, 3, 4, 5, and 6 mayinclude storing the data for the primitives in the appropriate buckets.Step 234 also includes ordering the primitives 2, 3, 4, 5, and 6 in thebuckets based on the primitives' minimum y-values. Thus, the primitives2, 3, 4, 5, and 6 are arranged from first to last in the appropriatebuckets, based upon the highest point in the display 150 for theprimitive. In addition, step 234 includes storing the top and bottomscans for each primitive. The top and bottom scans correspond to theminimum and maximum y-values for the primitive.

It is then determined if any of the bins overflow, via step 236. Thus,step 236 includes determining if any of the bins contain a sufficientnumber of primitives to violate the overflow parameter. Preferably thisis accomplished in one step after the primitives 2, 3, 4, 5, and 6 havebeen stored in the appropriate bins. Step 236 is also preferablyaccomplished by using the top scan line and bottom scan line for eachprimitive store in a bin to determined the whether the number ofprimitives 2, 3, 4, 5, or 6 on a particular scan line of a bin isgreater than the overflow parameter. If certain bins overflow, thenthese bins are treated separately, via step 238. In a preferredembodiment, step 238 includes overlaying the bins which overflow. Inanother embodiment, step 238 could include splitting the bins thatoverflow is splitting the bin will prevent the overflow. In any event,step 238 includes a mechanism which will allow those bins that overflowto be processed preferably without causing an overflow of the system 50.

Referring back to FIG. 8A, a bin is selected as a current bin, via step240. In a preferred embodiment, step 240 includes selecting a bin as thecurrent bin only if the bin has been determined not to overflow in step236. It is determined if the current bin can be combined with one ormore other bins without the combination overflowing, via step 242.Preferably, at least one of the other bins is adjacent to the currentbin and the other bins are mutually adjacent. If the current bin cannotbe combined without an overflow, the current bin is considered to be oneof the variable-sized bins. If the current bin cannot be combinedwithout an overflow, then it is determined if all of the desired binshave been attempted to be combined, via step 246.

If it is determined that the current bin can be combined, then thecurrent bin is combined with one or more other bins to provide one ofthe variable-sized bins, via step 244. The bin(s) with which the currentbin is combined with are those which were determined in step 242.Preferably, the current bin is combined with other bin(s) such that aprimitive in more than one bin only appears once in the variable-sizedbin that results from the combination. Step 246 is then returned to.Step 246 determines whether all of the desired bins have been attemptedto be combined. If not, then step 240 is returned to. If so, then adisplay list which orders the primitives variable-sized bin byvariable-sized bin is provided, via step 248. In one embodiment, step244 is performed in step 248. In such an embodiment, providing thedisplay list may also effectively combine the bins by providing theprimitives in the bins to be combined together in the display list.

To further explicate the method 230, refer to FIGS. 8B and 7B. FIG. 8Bis a diagram depicting how bins are combined. FIG. 7B depicts thedisplay 210 having a plurality of sections 211, 212, 213, 214, 215, 216,and 217 corresponding to a plurality of bins which were determined basedon a previous frame. Referring to FIGS. 7B and 8B, the primitives 2, 3,4, and 5 are stored in the bins 221′, 222′, 223′, 224′, 225′, 226′, and227′. The bins 221′, 222′, 223′, 224′, 225′, 226′, and 227′ correspondto the sections 211, 212, 213, 214, 215, 216, and 217, respectively.Because the primitives 2 and 3 cross the right boundary of the bin 221′(the section 211), the primitives 2 and 3 are stored in the right bucket252 of the bin 221′. Because there are no primitives in the display 210that intersect bin 251′ (the section 211) but do not cross the rightboundary of the bin 221′ (the section 211), the left bucket 251 of thebin 221′ is empty. Because the primitives 2 and 3 cross the rightboundary of the bin 222′ (the section 212), the primitives 2 and 3 arestored in the right bucket 254 of the bin 222′. Because there are noprimitives that intersect bin 222′ (the section 212) but do not crossthe right boundary of the bin 222′ (the section 212), the left bucket253 of the bin 162′ is empty. Because there are no primitives in the bin223′ (the section 213), the left bucket 255 and right bucket 256 of thebin 223′ are empty. Because the primitives 2 and 3 intersect but do notcross the right boundary of the bin 224′ (the section 214), theprimitives 2 and 3 are stored in the left bucket 257 of the bin 224′.Because there are no primitives that intersect bin 224′ (the section214) and cross the right boundary of the bin 224′ (the section 214), theright bucket 258 of the bin 224′ is empty. Because the primitives 2, 4,and 6 cross the right boundary of the bin 225′ (the section 215), theprimitives 4, 5, and 6 are stored in the right bucket 260 of the bin225′. Because no primitives intersect bin 225′ (the section 215) but donot cross the right boundary of the bin 225′ (the section 215), noprimitives are stored in the left bucket 259 of the bin 225′. Because noprimitives cross the right boundary of the bin 226′ (the section 216),the right bucket 262 of the bin 226′ is empty. Because the primitives 4and 5 intersect the bin 226′ (the section 216) but do not cross theright boundary of the bin 226′ (the section 216), the primitives 4 and 5are stored in the left bucket 261 of the bin 226′. Because no primitivescross the right boundary of the bin 227′ (the section 217), the rightbucket 264 of the bin 227′ is empty. Because the primitives 4 and 6intersect the bin 227′ (the section 217) but do not cross the rightboundary of the bin 227′ (the section 217), the primitives 4 and 6 arestored in the left bucket 263 of the bin 227′.

It is presumed that there are three processors in the processor block 64of FIG. 2. Thus, the overflow parameter may be three. Referring back toFIGS. 7B and 8B, none of the bins 221′-227′, or the correspondingsections 211-217, include more than three primitives 2, 3, 4, 5, and 6.Consequently, none of the bins overflow. Thus, all of the bins 221′-227′are candidates to be combined. Because the overflow parameter is three,the bins 211′, 212′, 213′, and 214′ can be combined into bin 228′without overflowing. Thus, primitives 2 and 3 can be stored in a singlebin 228′ that corresponds to the bins 221′-224′ and, therefore, tosections 211-214. For the same reasons, bins 225′, 226′, and 227′ can becombined into a single bin 229′ without overflowing.

The bins 221′-227′ are also preferably combined such that the primitives2, 3, 4, and 5 are stored only once in each variable sized bins 228′ and229′. Preferably, this is accomplished by storing only those primitiveswhich are in the left bucket for a bin, except for the last bin that isbeing combined. For the last bin, those primitives in the right bucketand the left bucket are combined. For example, there are no primitivesin the left bucket 251, 253, or 255 for the bins 221′, 222′, and 223′.Thus, no primitives are added. However, primitives 2 and 3 are in theleft bucket 257 for the bin 224′. Consequently, primitives 2 and 3 arestored in the left bucket 265 of the variable-sized bin 228′.Furthermore, there are no primitives in the right buckets 256 and 258 ofthe last bins 223′ and 224′ being combined. Thus, no other primitivesare stored in the variable-sized bin 228′. Consequently, thevariable-sized bin 228′ includes primitives 2 and 3 in the left bucket265 and no primitives in the right bucket 266. Furthermore, theprimitives 2 and 3 are stored in order in the variable-sized bin 228′based on their minimum y-values. Note, however, that in an alternateembodiment, the variable-sized bin 228′ could include primitives 2 and 3in both the right bucket 266 and the left bucket 265. Providing thedisplay list might then combine the bins 221′, 222′, 223′, and 224′. Inan alternate embodiment, no combining is provided until the display listis provided. In such an embodiment, the display list still combines thebins 221′, 222′, 223′, and 224′.

Similarly, the variable-sized bin 229′ includes primitives 4, 5, and 6.When bin 225′ is combined, no primitives are added to the buckets 267and 268 of the variable-sized bin 229′ because there are no primitivesin the left bucket 259 of the bin 225′. However, when the bins 226′ and227′ are combined, the primitives 4, 5, and 6 are stored because theyare in the left buckets 261 and 263 of the bins 226′ and 227′,respectively. If there were primitives in the right buckets 262 and 264,those primitives would have been stored in the variable-sized bin 229′because the bin 226′ and 227′ are the last bins being combined. Note,however, that in an alternate embodiment, the variable-sized bin 229′could include primitives 4, 5, and 6 in both the right bucket 267 andthe left bucket 268. Providing the display list might then combine thebins 225′, 226′, and 227′. In an alternate embodiment, no combining isprovided until the display list is provided. In such an embodiment, thedisplay list still combines the bins 225′, 226′, and 227′.

A display list is then provided from the variable-sized bins 228′ and229′. The display list preferably provides the primitives variable-sizedbin by variable-sized bin and preferably orders the primitives inminimum y-value order. Consequently, the display list would includeprimitives 2 and 3 then primitives 4, 6, and 5. The portions ofprimitives 2 and 3 intersecting the variable-sized bin 228′(intersecting sections 211, 212, 213, and 214) are rendered first,followed by the portions of primitives 4, 6, and 5 intersecting thevariable sized bin 229′ (intersecting sections 215, 216, and 217). Thedisplay list allows the primitives in a scan line to be provided inparallel to the processors of the block of processors in FIG. 3 and thepixels in each of the variable-sized bins 228′ and 229′ pixel by pixelin raster order.

Because the methods 200 and 230 render the graphical imagevariable-sized bin by variable-sized bin, the efficiency of rendering isimproved. Each variable-sized bin either does not overflow or is treatedseparately. In either case, each variable-sized bin can be renderedwithout causing an overflow in the computer graphics system, such as thesystem 50. Therefore, the primitives in a scan line for eachvariable-sized bin can be provided in parallel to processors in theblock of processors 64. Each variable-sized bin can, therefore, berendered pixel-by pixel in raster order without overflowing or slowingthe system 50. Consequently, efficiency of providing graphical images isimproved.

A method and system has been disclosed for more efficiently rendering agraphical image. Although the present invention has been described inaccordance with the embodiments shown, one of ordinary skill in the artwill readily recognize that there could be variations to the embodimentsand those variations would be within the spirit and scope of the presentinvention. Accordingly, many modifications may be made by one ofordinary skill in the art without departing from the spirit and scope ofthe appended claims.

What is claimed is:
 1. A method for providing a graphical image on adisplay of a system, the graphical image being provided from datadescribing a plurality of primitives, the display including a pluralityof pixels, the method comprising the steps of: (a) providing a pluralityof variable-sized bins containing the plurality of primitives; whereinthe system includes a plurality of processors for processing a portionof the plurality of primitives in parallel, and wherein thevariable-sized bin providing step (a) further includes the steps of:(a1) storing the plurality of primitives in a plurality of bins; (a2)determining if a part of a portion of the plurality of bins can becombined without causing the plurality of processors to overflow; and(a3) combining the part of the portion of plurality of bins to providethe plurality of variable-sized bins if the part of the portion of theplurality of bins can be combined without causing the plurality ofprocessors to overflow; wherein the plurality of variable-sized bins caninclude fewer bins than the plurality of bins; and (b) rendering theplurality of primitives by rendering each of the plurality ofvariable-sized bins variable-sized bin by variable-sized bin.
 2. Themethod of claim 1 wherein the combining step (a3) further includes thesteps of: (a3i) combining the part of the portion of the plurality ofbins so that a particular primitive of the plurality of primitives isprovided only once for a corresponding variable-sized bin of theplurality of variable-sized bins.
 3. The method of claim 1 wherein thevariable-sized bin providing step (a) further includes the steps of:(a4) providing a display list containing the plurality of primitives,the display list including the plurality of primitives ordered accordingto the plurality of variable-sized bins, wherein a particular primitiveof the plurality of primitives is provided to the display list only oncefor a corresponding variable-sized bin of the plurality ofvariable-sized bins.
 4. The method of claim 1, wherein each of theplurality of bins includes a first boundary, wherein each of theplurality of primitives intersects a second portion of the plurality ofbins, and wherein the storing step (a1) further includes the step of:(al i) storing each of the plurality of primitives in the second portionof the plurality of bins based on whether the first boundary is crossed.5. The method of claim/wherein each of the plurality of primitivesincludes a minimum y value, a top scan line, and bottom scan line, andwherein the storing step (a1) further includes the step of: (a1 ii)storing each of the plurality of primitives in the second portion of theplurality of bins in an order based on the minimum y value; and (a1 iii)storing the top scan line and the bottom scan line for each of theplurality of primitives in the second portion of the plurality of bins.6. A method for providing a graphical image on a display of a system,the graphical image being provided from data describing a plurality ofprimitives, wherein the system further includes a plurality ofprocessors for processing a portion of the plurality of primitives inparallel, the display including a plurality of pixels, the methodcomprising the steps of: (a) providing a plurality of variable-sizedbins containing the plurality of primitives and wherein thevariable-sized bin providing step (a) further includes the step of: (a1)determining a plurality of bins for a previous frame; and (a2) providingthe plurality of bins containing the plurality of primitives; (a3)storing the plurality of primitives in the plurality of bins; (a4)determining if a part of a portion of the plurality of bins can becombined without causing the plurality of processors to overflow; and(a5) combining the part of the portion of the plurality of bins toprovide the plurality of variable-sized bins if the part of the portionof the plurality of bins can be combined without causing the pluralityof processors to overflow; and (b) rendering the plurality of primitivesby rendering each of the plurality of variable-sized bins variable-sizedbin by variable-sized bin; wherein the plurality of variable-sized binscan include fewer bins than the plurality of bins.
 7. The method ofclaim 6 wherein the combining step (a5) further includes the steps of:(a5i) combining the part of the portion of the plurality of bins so thata particular primitive of the plurality of primitives is provided onlyonce for a corresponding variable-sized bin of the plurality ofvariable-sized bins.
 8. The method of claim 6 wherein the variable-sizedbin providing step (a) further includes the steps of: (a6) providing adisplay list containing the plurality of primitives, the display listincluding the portion of the plurality of primitives for each of theplurality of variable-sized bins ordered variable-sized bin byvariable-sized bin, wherein a particular primitive of the plurality ofprimitives is provided to the display list only once for a correspondingvariable-sized bin of the plurality of variable-sized bins.
 9. A methodfor providing a graphical image on a display of a system, the graphicalimage being provided from data describing a plurality of primitives,wherein the system further includes a plurality of processors forprocessing a portion of the plurality of primitives in parallel, thedisplay including a plurality of pixels, the method comprising the stepsof: (a) providing a plurality of variable-sized bins containing theplurality of primitives; wherein the variable-sized bin providing step(a) further includes the step of: (a1) determining a plurality of binsfor a previous frame; and (a2) providing the plurality of binscontaining the plurality of primitives (a3) determining if a portion ofthe plurality of bins causes the plurality of processors to overflow;and (a4) splitting each bin of the portion of the plurality of bins intotwo bins; and (b) rendering the plurality of primitives by renderingeach of the plurality of variable-sized bins variable-sized bin byvariable-sized bin.
 10. A computer-readable medium containing a programfor providing a graphical image on a display of a system, the graphicalimage being provided from data describing a plurality of primitives, thedisplay including a plurality of pixels, wherein the system includes aplurality of processors for processing a portion of the plurality ofprimitives in parallel, the program including instructions for: (a)providing a plurality of variable-sized bins containing the plurality ofprimitives; wherein the variable-sized bin providing instructions (a)further includes instructions for: (a1) storing the plurality ofprimitives in a plurality of bins; (a2) determining if a part of aportion of the plurality of bins can be combined without causing theplurality of processors to overflow; and (a3) combining the part of theportion of the plurality of bins if the portion of plurality of bins canbe combined without causing the plurality of processors to overflow; and(b) rendering the plurality of primitives by rendering each of theplurality of variable-sized bins variable-sized bin by variable-sizedbin; wherein the plurality of variable-sized bins can include fewer binsthan the plurality of bins.
 11. The computer-readable medium of claim 10wherein the combining instructions (a3) further includes instructionsfor: (a3i) combining the part of the portion of the plurality of bins sothat a particular primitive of the plurality of primitives is providedonly once for a corresponding variable-sized bin of the plurality ofvariable-sized bins.
 12. The computer-readable medium of claim 10,wherein the variable-sized bin providing instructions (a) furtherincludes instructions for: (a4) providing a display list containing theplurality of primitives, the display list including the plurality ofprimitives ordered according to the plurality of variable-sized bins,wherein a particular primitive of the plurality of primitives isprovided to the display list only once for a correspondingvariable-sized bin of the plurality of variable-sized bins.
 13. Thecomputer-readable medium of claim 10 wherein each of the plurality ofbins includes a first boundary, wherein each of the plurality ofprimitives intersects a second portion of the plurality of bins, andwherein the storing instructions (a1) further includes instructions for:(a1 i) storing each of the plurality of primitives in the second portionof the plurality of bins based on whether the first boundary is crossed.14. The computer-readable medium of claim 13 wherein each of theplurality of primitives includes a minimum y value, a top scan line, andbottom scan line, and wherein the storing instructions (a1) furtherincludes instructions for: (a1ii) storing each of the plurality ofprimitives in the second portion of the plurality of bins in an orderbased on the minimum y value; and (a1iii) storing the top scan line andthe bottom scan line for each of the plurality of primitives in thesecond portion of the plurality of bins.
 15. A computer-readable mediumcontaining a program for providing a graphical image on a display of asystem, the graphical image being provided from data describing aplurality of primitives, the display including a plurality of pixels,wherein the system further includes a plurality of processors forprocessing a portion of the plurality of primitives in parallel, theprogram including instructions for: (a) providing a plurality ofvariable-sized bins containing the plurality of primitives; wherein thevariable-sized bin providing instructions (a) further includesinstructions for: (a1) determining a plurality of bins for a previousframe; and (a2) providing the plurality of bins containing the pluralityof primitives (a3) storing the plurality of primitives in the pluralityof bins; (a4) determining if a part of a portion of the plurality ofbins can be combined without causing the plurality of processors tooverflow; and (a5) combining the part of the portion of the plurality ofbins if the part of the portion of the plurality of bins can be combinedwithout causing the plurality of processors to overflow; and (b)rendering the plurality of primitives by rendering each of the pluralityof variable-sized bins variable-sized bin by variable-sized bin whereinthe plurality of variable-sized bins can include fewer bins than theplurality of bins.
 16. The computer-readable medium of claim 15 whereinthe combining instructions (a5) further includes instructions for: (a5i)combining the part of the portion of the plurality of bins so that aparticular primitive of the portion of the plurality of primitives isprovided only once for a corresponding variable-sized bin of theplurality of variable-sized bins.
 17. The computer-readable medium ofclaim 15 wherein a portion of the plurality of primitives intersect eachof a second portion of the plurality of variable-sized bins and whereinthe variable-sized bin providing instructions (a) further includesinstructions for: (a6) providing a display list containing the pluralityof primitives, the display list including the portion of the pluralityof primitives for each of the plurality of variable-sized bins orderedvariable-sized bin by variable-sized bin, wherein a particular primitiveof the portion of the plurality of primitives is provided to the displaylist only once for a corresponding variable-sized bin of the pluralityof variable-sized bins.
 18. A computer-readable medium containing aprogram for providing a graphical image on a display of a system, thegraphical image being provided from data describing a plurality ofprimitives, the display including a plurality of pixels, wherein thesystem further includes a plurality of processors for processing aportion of the plurality of primitives in parallel, the programincluding instructions for: (a) providing a plurality of variable-sizedbins containing the plurality of primitives; wherein the variable-sizedbin providing instructions (a) further includes instructions for: (a1)determining a plurality of bins for a previous frame; and (a2) providingthe plurality of bins containing the plurality of primitives (a3)determining if a portion of the plurality of bins causes the pluralityof processors to overflow; and (a4) splitting each bin of the portion ofthe plurality of bins into two bins; and (b) rendering the plurality ofprimitives by rendering each of the plurality of variable-sized binsvariable-sized bin by variable-sized bin.
 19. A system for providing agraphical image on a display, the graphical image being provided fromdata describing a plurality of primitives, the display including aplurality of pixels, wherein the system includes a plurality ofprocessors for processing a portion of the plurality of primitives inparallel, the system comprising: means providing a plurality ofvariable-sized bins containing the plurality of primitives, theplurality of bins having a variable size; and wherein the variable-sizedbin providing means further includes: means for storing the plurality ofprimitives in a plurality of bins; means for determining if a part of aportion of the plurality of bins can be combined without causing theplurality of processors to overflow; and means for combining the part ofthe portion of the plurality of bins if the part of the portion of theplurality of bins can be combined without causing the plurality ofprocessors to overflow; and means, coupled with the providing means, forrendering the plurality of primitives by rendering each of the pluralityof variable-sized bins variable-sized bin by variable-sized bin whereinthe plurality of variable-sized bins can include fewer bins than theplurality of bins.
 20. The system of claim 19, wherein thevariable-sized bin providing means further includes: means for combiningthe part of the portion of the plurality of bins so that a particularprimitive of the plurality of primitives is provided only once for acorresponding variable-sized bin of the plurality of variable-sizedbins.
 21. The system of claim 19 wherein the variable-sized binproviding means further includes: means for providing a display listcontaining the plurality of primitives, the display list including theplurality of primitives ordered according to the plurality ofvariable-sized bins, wherein a particular primitive of the plurality ofprimitives is provided to the display list only once for a correspondingvariable-sized bin of the plurality of variable-sized bins.
 22. A systemfor providing a graphical image on a display, the graphical image beingprovided from data describing a plurality of primitives, furtherincluding a plurality of processors for processing a portion of theplurality of primitives in parallel, the display including a pluralityof pixels, the system comprising: means providing a plurality ofvariable-sized bins containing the plurality of primitives, theplurality of bins having a variable size; wherein the variable-sized binproviding means further includes: means for determining a plurality ofbins for a previous frame; means for providing the plurality of binscontaining the plurality of primitives; means for storing the pluralityof primitives in the plurality of bins; means for determining if a partof a portion of the plurality of bins can be combined without causingthe plurality of processors to overflow; and means for combining thepart of the portion of the plurality of bins if the portion of theplurality of bins can be combined without causing the plurality ofprocessors to overflow; wherein the plurality of variable-sized bins caninclude fewer bins than the plurality of bins; and means, coupled withthe providing means, for rendering the plurality of primitives byrendering each of the plurality of variable-sized bins variable-sizedbin by variable-sized bin.
 23. The system of claim 22 further comprisinga plurality of processors for processing a portion of the plurality ofprimitives in parallel and wherein the variable-sized bin providingmeans further includes: means for determining if a portion of theplurality of bins causes the plurality of processors to overflow; andmeans for splitting each bin of the portion of the plurality of binsinto two bins.